The Stability Problem for Discrete Event Dynamical Systems Modeled with timed Petri Nets Using a Lyapunov-Max-Plus Algebra Approach

A discrete event system, is a dynamical system whose state evolves in time by the occurrence of events at possibly irregular time intervals. Place-transitions Petri nets (commonly called Petri nets) are a graphical and mathematical modeling tool applicable to discrete event systems in order to represent its states evolution. Timed Petri nets are an extension of Petri nets that model discrete event systems where now the timing at which the state changes is taken into consideration. One of the most important performance issues to be considered in a discrete event dynamical system is its stability. Lyapunov stability theory provides the required tools needed to aboard the stability problem for discrete event systems modeled with timed Petri nets whose mathematical model is given in terms of difference equations. By proving practical stability one is allowed to preassigned the bound on the discrete event systems dynamics performance. Moreover, employing Lyapunov methods, a sufficient condition for the stabilization problem is also obtained. It is shown that it is possible to restrict the discrete event systems state space in such a way that boundedness is guaranteed. However, this restriction results to be vague. This inconvenience is overcome by considering a specific recurrence equation, in the max-plus algebra, which is assigned to the timed Petri net graphical model. Mathematics Subject Classification: 08A99, 93D35, 93D99, 39A11